Solvability of Peg Solitaire on Graphs is NP-Complete
نویسندگان
چکیده
Peg solitaire is a single-player board game. The goal of the game to remove all but one peg from board. on graphs played arbitrary graphs. A graph called solvable if there exists some vertex s such that it possible starting with as initial hole. In this paper, we prove NP-complete decide or not.
منابع مشابه
Spider Solitaire is NP-Complete
This paper will prove that a generalized version of the popular solitaire variant SpiderSolitaire is NP-Complete. This proof is very similar to section 4.3 of Malte Helmert’s Complexity results for standard benchmark domains in planning Artificial Intelligence 143 (2), pp. 219262. 2003, but is re-tailored to fit the game of SpiderSolitaire, rather the FreeCell. In order to determine the domain ...
متن کاملSolitaire Chess is NP-complete
Solitaire Chess” is a logic puzzle published by ThinkfunTM that can be seen as a single person version of traditional chess. Given a chess board with some chess pieces of the same color placed on it, the task is to capture all pieces but one using only moves that are allowed in chess. Moreover, in each move one piece has to be captured. We prove that deciding if a given instance of Solitaire Ch...
متن کاملReversible peg solitaire on graphs
The game of peg solitaire on graphs was introduced by Beeler and Hoilman in 2011. In this game, pegs are initially placed on all but one vertex of a graph GG. If xyz forms a path in GG and there are pegs on vertices x and y but not z, then a jump places a peg on z and removes the pegs from x and y. A graph is called solvable if, for some configuration of pegs occupying all but one vertex, some ...
متن کاملPolynomial solvability of $NP$-complete problems
A polynomial algorithm for solving the ”Hamiltonian circuit” problem is presented in the paper. Computational complexity of the algorithm is equal to O ( n log 2 n ) where n is the cardinality of the observed graph vertex set. Thus the polynomial solvability for NP -complete problems is proved.
متن کاملDeciding Morality of Graphs is NP-complete
In order to find a causal explanation for data presented in the form of covariance and con centration matrices it is necessary to decide if the graph formed by such associations is a projection of a directed acyclic graph ( dag). We show that the general problem of deciding whether such a dag exists is NP-complete.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2023
ISSN: ['0916-8532', '1745-1361']
DOI: https://doi.org/10.1587/transinf.2022edp7092